The MasPar MP-1 as a computer arithmetic laboratory
نویسندگان
چکیده
منابع مشابه
The MasPar MP-1 As a Computer Arithmetic Laboratory
This paper is a blueprint for the use of a massively parallel SIMD computer architecture for the simulation of various forms of computer arithmetic. The particular system used is a DEC/MasPar MP-1 with 4096 processors in a square array. This architecture has many advantages for such simulations due largely to the simplicity of the individual processors. Arithmetic operations can be spread acros...
متن کاملThe CuPit Compiler for the MasPar MP-1 and MP-2 A Literate Programming Document
This document contains the complete source code of the CuPit compiler for the MasPar MP-1/MP-2 SIMD parallel machines. The compiler is presented as a FunnelWeb literate programming document that contains de nitions for the various speci cation les needed by the Eli compiler construction system. The exactly same set of les that enabled FunnelWeb to produce this document also enable Eli to produc...
متن کاملB-Flashsort: A High-performance Sort for the MasPar MP-1 and MP-2 Implementation Description
The sorting of large data sets is a key step in a great variety of applications such as query processing, polygon rendering, statistical analysis and optimization problems. While efficient sorting techniques and implementations have long been available for sequential computers, the problem remains a challenge for parallel computers. One reason is that efficient sequential algorithms take into a...
متن کاملLog Time Parsing on the MasPar MP-1
This paper describes the parallelization of Constraint Dependency Grammar (CDG) parsing. Though CDG provides a exible framework for text-based and spoken language parsing and has an expressivity strictly greater than context-free grammars (CFGs), it also has a relatively slow serial running time (i.e., O(n 4)). However, a paralleliza-tion for this algorithm is derived which uses O(n 4) processo...
متن کاملEfficient Oblivious Parallel Sorting on the MasPar MP-1
We address the problem of sorting a large number N of keys on a MasPar MP-1 parallel SIMD machine of moderate size P where the processing elements (PEs) are interconnected as a toroidal mesh and have 16KB local storage each. We present a comparative study of implementations of the following deterministic oblivious sorting methods: Bitonic Sort, Odd-Even Merge Sort, and FastSort. We successfully...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Institute of Standards and Technology
سال: 1996
ISSN: 1044-677X
DOI: 10.6028/jres.101.018